Special Issue on TreesGOUVEIA, Luis.Networks (New York, NY). 2009, Vol 53, Num 2, issn 0028-3045, 143 p.Serial Issue

A node rooted flow-based model for the local access network expansion problemCORTE-REAL, Margarida; GOUVEIA, Luis.European journal of operational research. 2010, Vol 204, Num 1, pp 20-34, issn 0377-2217, 15 p.Article

Network flow models for designing diameter-constrained minimum-spanning and Steiner treesGOUVEIA, Luis; MAGNANTI, Thomas L.Networks (New York, NY). 2003, Vol 41, Num 3, pp 159-173, issn 0028-3045, 15 p.Article

The capacitated minimum spanning tree problem: revisiting hop-indexed formulationsGOUVEIA, Luis; MARTINS, Pedro.Computers & operations research. 2005, Vol 32, Num 9, pp 2435-2452, issn 0305-0548, 18 p.Article

Further contributions to network optimizationBEN-AMEUR, Walid; GOUVEIA, Luis.Networks (New York, NY). 2006, Vol 48, Num 1, pp 1-6, issn 0028-3045, 6 p.Article

Network flow models for the local access network expansion problemCORTE-REAL, Margarida; GOUVEIA, Luis.Computers & operations research. 2007, Vol 34, Num 4, pp 1141-1157, issn 0305-0548, 17 p.Article

Multistars and directed flow formulationsGOUVEIA, Luis; HALL, Leslie.Networks (New York, NY). 2002, Vol 40, Num 4, pp 188-201, issn 0028-3045, 14 p.Article

Special Issue on INOC 2011 Conference, June 13-16, 2011, Hamburg, GermanyGOUVEIA, Luis; VOSS, Stefan.Networks (New York, NY). 2013, Vol 61, Num 2, issn 0028-3045, 113 p.Conference Proceedings

The Minimum Evolution Problem : Overview and ClassificationCATANZARO, Daniele.Networks (New York, NY). 2009, Vol 53, Num 2, pp 112-125, issn 0028-3045, 14 p.Article

The multi-weighted Steiner tree problem : A reformulation by intersectionGOUVEIA, Luis; TELHADA, Joao.Computers & operations research. 2008, Vol 35, Num 11, pp 3599-3611, issn 0305-0548, 13 p.Article

Reformulation by discretization : Application to economic lot sizingCONSTANTINO, Miguel; GOUVEIA, Luis.Operations research letters. 2007, Vol 35, Num 5, pp 645-650, issn 0167-6377, 6 p.Article

Multicommodity flows and network designGOUVEIA, Luis; VOSS, Stefan.Networks (New York, NY). 2007, Vol 49, Num 1, issn 0028-3045, 135 p.Conference Proceedings

Some recent contributions to Network OptimizationBEN-AMEUR, Walid; GOUVEIA, Luis.Networks (New York, NY). 2004, Vol 44, Num 1, pp 27-30, issn 0028-3045, 4 p.Article

Models for a traveling purchaser problem with additional side-constraintsGOUVEIA, Luis; PAIAS, Ana; VOSS, Stefan et al.Computers & operations research. 2011, Vol 38, Num 2, pp 550-558, issn 0305-0548, 9 p.Article

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphsGOUVEIA, Luis; SIMONETTI, Luidi; UCHOA, Eduardo et al.Mathematical programming (Print). 2011, Vol 128, Num 1-2, pp 123-148, issn 0025-5610, 26 p.Article

A 2-path approach for odd-diameter-constrained minimum spanning and steiner treesGOUVEIA, Luis; MAGNANTI, Thomas L; REQUEJO, Cristina et al.Networks (New York, NY). 2004, Vol 44, Num 4, pp 254-265, issn 0028-3045, 12 p.Article

The Orienteering Problem with Variable ProfitsERDOGAN, Güneş; LAPORTE, Gilbert.Networks (New York, NY). 2013, Vol 61, Num 2, pp 104-116, issn 0028-3045, 13 p.Conference Paper

A Note on Trees, Tables, and AlgorithmsGODDARD, Wayne; HEDETNIEMI, Stephen T.Networks (New York, NY). 2009, Vol 53, Num 2, pp 184-190, issn 0028-3045, 7 p.Article

Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic RoutingPOSS, Michael; RAACK, Christian.Networks (New York, NY). 2013, Vol 61, Num 2, pp 180-198, issn 0028-3045, 19 p.Conference Paper

Decomposition Algorithms for the Design of a Nonsimultaneous Capacitated Evacuation Tree NetworkANDREAS, April K; COLE SMITH, J.Networks (New York, NY). 2009, Vol 53, Num 2, pp 91-103, issn 0028-3045, 13 p.Article

The Continuous and Discrete Path-Variance Problems on TreesPUERTO, Justo; RICCA, Federica; SCOZZARI, Andrea et al.Networks (New York, NY). 2009, Vol 53, Num 2, pp 221-228, issn 0028-3045, 8 p.Article

Multicommodity flow problems with a bounded number of paths : A flow deviation approachDUHAMEL, Christophe; MAHEY, Philippe.Networks (New York, NY). 2007, Vol 49, Num 1, pp 80-89, issn 0028-3045, 10 p.Conference Paper

Discretized formulations for capacitated location problems with modular distribution costsCORREIA, Isabel; GOUVEIA, Luis; SALDANHA-DA-GAMA, Francisco et al.European journal of operational research. 2010, Vol 204, Num 2, pp 237-244, issn 0377-2217, 8 p.Article

Models and Heuristics for a Minimum Arborescence ProblemDUHAMEL, Christophe; GOUVEIA, Luis; MOURA, Pedro et al.Networks (New York, NY). 2008, Vol 51, Num 1, pp 34-47, issn 0028-3045, 14 p.Article

Solving the variable size bin packing problem with discretized formulationsCORREIA, Isabel; GOUVEIA, Luis; SALDANHA-DA-GAMA, Francisco et al.Computers & operations research. 2008, Vol 35, Num 6, pp 2103-2113, issn 0305-0548, 11 p.Article